Identifying codes of cycles
نویسندگان
چکیده
منابع مشابه
Identifying codes of cycles with odd orders
The problem of the r -identifying code of a cycle Cn has been solved totally when n is even. Recently, S. Gravier et al. give the r -identifying code for the cycle Cn with the minimum cardinality for odd n, when n ≥ 3r + 2 and gcd(2r + 1, n) 6= 1. In this paper, we deal with the r -identifying code of the cycle Cn for odd n, when n ≥ 3r + 2 and gcd(2r + 1, n) = 1. c © 2007 Elsevier Ltd. All rig...
متن کاملIdentifying codes and locating-dominating sets on paths and cycles
Let G = (V,E) be a graph and let r ≥ 1 be an integer. For a set D ⊆ V , define Nr[x] = {y ∈ V : d(x, y) ≤ r} and Dr(x) = Nr[x] ∩ D, where d(x, y) denotes the number of edges in any shortest path between x and y. D is known as an r-identifying code (r-locating-dominating set, respectively), if for all vertices x ∈ V (x ∈ V \D, respectively), Dr(x) are all nonempty and different. In this paper, w...
متن کاملIdentifying and locating-dominating codes on chains and cycles
Consider a connected undirected graph G = (V, E), a subset of vertices C ⊆ V , and an integer r ≥ 1; for any vertex v ∈ V , let Br (v) denote the ball of radius r centered at v, i.e., the set of all vertices within distance r from v. If for all vertices v ∈ V (respectively, v ∈ V \C), the sets Br (v) ∩ C are all nonempty and different, then we call C an r -identifying code (respectively, an r -...
متن کاملThe Paradoxical Nature of Locating Sensors in Paths and Cycles: The Case of 2-Identifying Codes
For a graph G and a set D ⊆ V (G), define Nr[x] = {xi ∈ V (G) : d(x, xi) ≤ r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] ∩D. D is known as an r-identifyingcode if for every vertex x, Dr(x) 6= ∅, and for every pair of vertices x and y, x 6= y ⇒ Dr(x) 6= Dr(y). The various applications of these codes include attack sensor placement in networks and fault detection/localization i...
متن کاملIdentifying refactoring opportunities by identifying dependency cycles
1:30pm 3:00pm APCCM 1 Keynote ACSC 2 Software Engineering and Formal Methods ACE 1 AUIC 1 Augmented Reality ADC 1a Invited Talk AusGRID 1 Logic and Refinement for Charts Greg Reeve, Steve Reeves Up Close and Pedagogical: Computing Academics Talk About Teaching C. Kutay, R. Lister Evaluation of User Satisfaction and Learnability for Outdoor Augmented Reality Gaming Benjamin Avery, Wayne Piekarsk...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2006
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2004.09.005